Least squares tracking on the Euclidean group

نویسندگان

  • Youngmo Han
  • Frank Chongwoo Park
چکیده

A large class of problems in robotics, e.g., trajectory tracking with obstacle avoidance, compliant motion control, and complex assembly, can be formulated as a least-squares tracking problem on the Euclidean group subject to constraints on the state and/or control. In this note we develop an optimal control framework for this general class of problems, and derive analytic solutions for the local and global versions of the general optimal control problem. Our formalism can be viewed in some sense as an extension to the Euclidean group of the linear quadratic regulator (LQR) subject to state equality constraints. Examples from force-guided complex assembly and tracking with obstacle avoidance are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euclidean distances and least squares problems for a given set of vectors ✩

Given an m× n matrix A, n Euclidean distances, those from each column to the space spanned by the remaining columns of A, are considered. An elegant relationship between A, these Euclidean distances, and the solutions of n simple linear least squares problems arising from A is derived. When A has full column rank, from this a useful expression for these Euclidean distances is immediately obtain...

متن کامل

On Least Squares Euclidean Distance Matrix Approximation and Completion

The Euclidean distance matrix approximation problem as well as the completion problem have received a lot of attention in recent years because of their many important applications. In contrast to the many interesting but often sophisticated algorithms proposed in the literature, this paper offers a relatively straightforward procedure that can tackle both problems by the same framework. The loc...

متن کامل

Terrain Image Segmentation Based on Wavelet Transform and Partial Least Squares

Image segmentation is a fundamental stage in several domains of knowledge, in particular, remote sensing applications. Its main purpose is to partition an image into constituent regions of interest through characteristics such as pixel intensity or color, texture, and shape of objects. This work presents a two-stage image segmentation method, allowing an overall computation cost reduction while...

متن کامل

A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distances

MINIMIZING THE SUM OF EUCLIDEAN DISTANCES YUYING LI Abstract. The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweighted least squares method. It exhibits linear convergence. In this paper, a Newton type algorithm with similar simplicity is proposed to solve a continuous multifacility location problem with Euclidean distance measure. Similar to the W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2001